On the Composition of Non-parahalting Macro Instructions

نویسنده

  • Piotr Rudnicki
چکیده

An attempt to use the Times macro, [2], was the origin of writing this article. First, the semantics of the macro composition as developed in [23, 3, 4] is extended to the case of macro instructions which are not always halting. Next, several functors extending the memory handling for SCMFSA, [18], are defined; they are convenient when writing more complicated programs. After this preparatory work, we define a macro instruction computing the Fibonacci sequence (see the SCM program computing the same sequence in [10]) and prove its correctness. The semantics of the Times macro is given in [2] only for the case when the iterated instruction is parahalting; this is remedied in [17].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Initialization Halting Concepts and Their Basic Properties of SCMFSA

Up to now, many properties of macro instructions of SCMFSA are described by the parahalting concepts. However, many practical programs are not always halting while they are halting for initialization states. For this reason, we propose initialization halting concepts. That a program is initialization halting (called ”InitHalting” for short) means it is halting for initialization states.In order...

متن کامل

Another times Macro Instruction

The semantics of the times macro is given in [2] only for the case when the body of the macro is parahalting. We remedy this by defining a new times macro instruction in terms of while (see [9, 13]). The semantics of the new times macro is given in a way analogous to the semantics of while macros. The new times uses an anonymous variable to control the number of its executions. We present two e...

متن کامل

The Construction and Shiftability of Program Blocks for SCMPDS1

In this article, a program block is defined as a finite sequence of instructions stored consecutively on initial positions. Based on this definition,any program block with more than two instructions can be viewed as the combination of two smaller program blocks. To describe the computation of a program block by the result of its two sub-blocks, we introduce the notions of paraclosed, parahaltin...

متن کامل

The Construction and Shiftability of Program Blocks for SCMPDS

In this article,a program block is defined as a finite sequence of instructions stored consecutively on initial positions. Based on this definition,any program block with more than two instructions can be viewed as the combination of two smaller program blocks. To describe the computation of a program block by the result of its two sub-blocks, we introduce the notions of paraclosed, parahalting...

متن کامل

Computation of Two Consecutive Program Blocks for SCMPDS

In this article, a program block without halting instructions is called No-StopCode program block. If a program consists of two blocks, where the first block is parahalting (i.e. halt for all states) and No-StopCode, and the second block is parahalting and shiftable, it can be computed by combining the computation results of the two blocks. For a program which consists of a instruction and a bl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998